#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int longestOnes(vector<int>& nums, int k) {
        int left = 0, right = 0, n = nums.size(), len = 0, zero = 0;
        for (; right < n; right++) {
            if (nums[right] == 0) {
                zero++;
            }
            while (zero > k) {
                if (nums[left++] == 0)
                    zero--;
            }
            len = max(len, right - left + 1);

        }
        return len;

    }
};